Implementation Test Symbolic/statistical Mult
نویسنده
چکیده
The design and implementation of hybrid symbolic/statistical architectures is a major area of interest in current multimodal system development. Such an architecture attempts to improve multimodal recognition and disambiguation rates by using corpus-based statistics to weight the contributions from various input streams. This is in contrast to current architectures that assume independence between input streams, and combine un-weighted posterior probabilities simply by taking their cross product. Recently a Members, Teams, Committee (MTC) approach for statistically hybridizing the Quickset multimodal system has been put forward on the basis of strong empirical results in an offline analysis. MTC uses small-dimensional input streams as Members, which in turn are input into various Teams where their conditional weights are trained. The Committee then extracts a decision from the output of the Teams. This paper discusses a fully implemented regression test of MTC within Quickset, and our modification of the approach to use more specific training features. We report a relative decrease in multimodal error rate of 30%.
منابع مشابه
A generalized K statistic for estimating phylogenetic signal from shape and other high-dimensional multivariate data.
Phylogenetic signal is the tendency for closely related species to display similar trait values due to their common ancestry. Several methods have been developed for quantifying phylogenetic signal in univariate traits and for sets of traits treated simultaneously, and the statistical properties of these approaches have been extensively studied. However, methods for assessing phylogenetic signa...
متن کاملComplete test graph generation for symbolic real-time systems∗
We study the generation of test cases for symbolic real-time systems. By symbolic, we mean that the specification of the implementation under test (IUT) is described by using variables and parameters. And by real-time, we mean that the specification of the IUT contains timing constraints. Our method combines and generalizes two test methods presented in previous work, namely : 1) a method for g...
متن کاملSymbolic method for siimplifying AND-EXOR representations of Boolean functions using a binary- decision technique and a genetic algorithm
-1 Abstract: An algorithm called XOF.GA is presented which minimises Boolean mult i-output logic functions as multilevel ANDEXOR networks of two-input logic gates. It carries out symbolic simplification, and works from tlhe bottom of a binary variable decision tree to tlhe top, with variable choice determined using a genetic algorithm. Since the algorithm is multilevel in nature, it delivers mo...
متن کاملSymbolic It^ O Calculus in Axiom: an Ongoing Story Symbolic It^ O Calculus in Axiom: an Ongoing Story
Symbolic It^ o calculus refers both to the implementation of It^ o calculus in a computer algebra package and to its application. This article 1 reports on progress in the implementation of It^ o calculus in the powerful and innovative computer algebra package AXIOM, in the context of a decade of previous implementations and applications. It is shown how the elegant algebraic structure underlyi...
متن کاملWhy VLSI Implementations of Associative VLCNs Require Mult iplexingt
In recent years there has been a great deal of interest developed ’ Connectionist/Neural Networks (CNNb; These are networks of simple processors where the network state is represented by the outputs of the processors and the strengths of the connections between them. They are characterized by asynchrony, a high degree of connectivity, and good fault tolerance. CNNs are seen as providing solutio...
متن کامل